Self-Stabilizing Algorithms in DAG Structured Networks

نویسندگان

  • Sajal K. Das
  • Ajoy Kumar Datta
  • Sébastien Tixeuil
چکیده

This paper describes a parameterised protocol applicable to directed acyclic graph (DAG ) topologiesThe function parameter of the protocol is instantiated twice to design two specific protocols: (i) the topological sorting of the successor list at every node, and (ii) a shortest path routing table constructionBoth protocols are self-Stabilizing and thus they are resilient to transient failures and guarantee system recovery in a finite time linear in the network diameter. Erom the fact that a DAG topology can be imposed on a more general topology through graph labeling protocols, the solutions presented in this paper are expected to be quite useful for a large class of distributed systems, where an optimal routing along with the robustness and fault tolerance are key factors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-stabilizing DAG-Constructing Protocols with Application to Geocast in MANET

Constructing Directed Acyclic Graph (DAG) on a graph is one of the fundamental problems of graph theory. We propose a self-stabilizing protocol for DAG construction on mobile ad-hoc network (MANET) and show that it can construct a DAG which has better property than known one. Furthermore, we evaluate our protocol by applying it to geocast protocol on MANET. Our computer simulation results show ...

متن کامل

On Fast Randomized Colorings in Sensor Networks

We present complexity analysis for a family of self-stabilizing vertex coloring algorithms in the context of sensor networks. First, we derive theoretical results on the stabilization time when the system is synchronous. Then, we provide simulations for various schedulings and topologies. We consider both the uniform case (where all nodes are indistinguishable and execute the same code) and the...

متن کامل

Analyzing Tools and Algorithms for Privacy Protection and Data Security in Social Networks

The purpose of this research, is to study factors influencing privacy concerns about data security and protection on social network sites and its’ influence on self-disclosure. 100 articles about privacy protection, data security, information disclosure and Information leakage on social networks were studied. Models and algorithms types and their repetition in articles have been distinguished a...

متن کامل

Notes on hierarchical ensemble methods for DAG-structured taxonomies

Several real problems ranging from text classification to computational biology are characterized by hierarchical multi-label classification tasks. Most of the methods presented in literature focused on tree-structured taxonomies, but only few on taxonomies structured according to a Directed Acyclic Graph (DAG). In this contribution novel classification ensemble algorithms for DAG-structured ta...

متن کامل

Randomized Self-stabilizing Algorithms for Wireless Sensor Networks

Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of wireless communication can lead to situations, where nodes lose synchrony and programs reach arbitrary states. Traditional approaches to fault tolerance like replication or global resets are not feasible. In this work,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999